Heuristics for Thelen’s Prime Implicant Method
نویسندگان
چکیده
Thelen’s algorithm is an efficient method for generation of the prime implicants of a Boolean function represented in CNF. In the paper new heuristics are presented, allowing to accelerate the algorithm. Experimental analysis of their effects is performed.
منابع مشابه
A Novel Essential Prime Implicant Identification Method for Exact Direct Cover Logic Minimization
Most of the direct-cover Boolean minimization techniques use a four step cyclic algorithm. First, the algorithm chooses an On-minterm; second, it generates the set of prime implicants that covers the chosen minterm; third, it identifies the essential prime implicant; and fourth, it performs a covering operation. In this study, we focus on the third step and propose a new essential prime implica...
متن کاملMETAPRIME, an Interactive Fault Tree Analyser
The performances of almost all available fault tree analysis tools are limited by the performance of the prime implicant computation procedure they use. All these procedures manipulate the prime implicants of the fault trees in extension, so that the analysis costs are directly related to the number of prime implicants to be generated, which in practice makes these tools di cult to be applied o...
متن کاملIn Search of a Better Heuristic Algorithm for Simplification of Switching Function A Challenge to ESPRESSO
Finding minimum cost switching function is an intractable problem. The number of prime implicant of a typical switching function is the order of 3 [5][13]. When fitness function with respect to cost is the only goal, the existing algorithms require faces combinatorial explosion [20]. The allurement of approximation and heuristic algorithms in this area has already generated ESPRESSO algorithm. ...
متن کاملConflict-Based Belief Revision Operators in Possibilistic Logic
In this paper, we investigate belief revision in possibilistic logic, which is a weighted logic proposed to deal with incomplete and uncertain information. Existing revision operators in possibilistic logic are restricted in the sense that the input information can only be a formula instead of a possibilistic knowledge base which is a set of weighted formulas. To break this restriction, we cons...
متن کاملPrime Implicant Computation Using Satisfiability Algorithms
The computation of prime implicants has several and significant applications in different areas, including Automated Reasoning, Non-Monotonic Reasoning, Electronic Design Automation, among others. In this paper we describe a new model and algorithm for computing minimum-size prime implicants of propositional formulas. The proposed approach is based on creating an integer linear program (ILP) fo...
متن کامل